Finding Adam in random growing trees
نویسندگان
چکیده
منابع مشابه
Finding Adam in random growing trees
We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of K vertices, such that, with probability at least 1 − ε, the first vertex is in this set. We show that for any ε, there exist such algorithms with K independent of the size of the input tree. Moreover, we provid...
متن کاملPersistence of centrality in random growing trees
We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For random trees grown according to a preferential attachment model, a uniform attachment model, or a diffusion processes over a regular tree, we prove that a si...
متن کاملGrowing Binary Trees in a Random Environment
We study a class of binary trees that grow in a random environment, where the state of the environment can change at every vertex of the trees. The trees considered are single-type and two-type binary trees that grow in a two-state Markovian environment. For each kind of tree, the conditions on the environment process for extinction of the tree are determined, and the problem of calculating the...
متن کاملFinding Rumor Sources on Random Trees
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when these nodes became infected. In a recent work (Shah and Zaman 2010) this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality a...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20649